Digital Library

Search: "[ keyword: Priority Queue ]" (7)
    A Study on the Runtime Test of Priority Queues
    Hae Jae Jung The KIPS Transactions:PartA, Vol. 17, No. 4, pp. 167-172, Aug. 2010
    10.3745/KIPSTA.2010.17.4.167

    A Double-Ended Priority Queue with O(1) Insertion Amortized Time
    Hae Jae Jung The KIPS Transactions:PartA, Vol. 16, No. 3, pp. 217-222, Jun. 2009
    10.3745/KIPSTA.2009.16.3.217

    Insertion/Deletion algorithms on M-heap with an array representation
    Hae Jae Jung The KIPS Transactions:PartA, Vol. 13, No. 3, pp. 261-266, Jun. 2006
    10.3745/KIPSTA.2006.13.3.261

    4-Deap: A Fast 4-ary Deap using Cache
    Hae Jae Jung The KIPS Transactions:PartA, Vol. 11, No. 7, pp. 577-582, Dec. 2004
    10.3745/KIPSTA.2004.11.7.577

    8-heap: A fast 8-ary implicit priority queue
    Hae Jae Jung The KIPS Transactions:PartA, Vol. 11, No. 3, pp. 213-216, Jun. 2004
    10.3745/KIPSTA.2004.11.3.213

    IMI-Heap: An Implicit Double-Ended Priority Queue with Constant Insertion Amortized Time Complexity
    Haejae Jung KIPS Transactions on Computer and Communication Systems, Vol. 8, No. 2, pp. 29-34, Feb. 2019
    https://doi.org/10.3745/KTCCS.2019.8.2.29
    Keywords: Double-Ended Priority Queue, Implicit Heap, Amortized Time Complexity, Data Structures

    Implicit D-Ary AM-Heap
    Haejae Jung KIPS Transactions on Computer and Communication Systems, Vol. 7, No. 12, pp. 289-294, Dec. 2018
    https://doi.org/10.3745/KTCCS.2018.7.12.289
    Keywords: Priority Queue, Implicit Heap, Amortized Time Complexity, Data Structures

Forms



Category Search

Publications


Old Journals


Indexing


All publications of KTCCS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

KTCCS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Organization


Related Journals